An Anarchic Society Optimization Algorithm for a Flow-Shop Scheduling Problem with Multiple Transporters between Successive Machines
نویسندگان
چکیده
This paper addresses a Permutation Flow-shop Scheduling Problem (PFSP) where there is a finite number of transporters between any two successive machines to carry jobs from one machine to the subsequent machine. In order to solve the problem, an effective Anarchic Society Optimization (ASO) algorithm is developed to find a sequence of jobs with nearly-minimum makespan. The proposed ASO algorithm is compared with a Particle Swarm Optimization (PSO) algorithm on a set of benchmark test problems. The results show that the ASO algorithm considerably outperforms the PSO algorithm. Finally, a sensitivity analysis is carried out to examine the impact of the number of transporters on the performance of the manufacturing system.
منابع مشابه
New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملIntegrating employee timetabling with scheduling of machines and transporters in a job-shop environment: A mathematical formulation and an Anarchic Society Optimization algorithm
This paper addresses a ternary-integration scheduling problem that incorporates employee timetabling into the scheduling of machines and transporters in a job-shop environment with a finite number of heterogeneous transporters where the objective is to minimize the completion time of all jobs. The problem is first formulated as a mixed-integer linear programming model. Then, an Anarchic Society...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملA Reliability based Modelling and Optimization of an Integrated Production and Preventive Maintenance Activities in Flowshop Scheduling Problem
Traditional scheduling problems with the batch processing machines (BPM) assume that machines are continuously available, and no time is needed for their preventive maintenance (PM). In this paper, we study a realistic variant of flowshop scheduling which integrates flow shop batch processing machines (FBPM) and preventive maintenance for minimizing the makespan. In order to tackle the given pr...
متن کامل